Distributed recursive least squares strategies for adaptive reconstruction of graph signals

This work proposes distributed recursive least squares (RLS) strategies for adaptive reconstruction and learning of signals defined over graphs. First, we introduce a centralized RLS estimation strategy with probabilistic sampling, and we propose a sparse sensing method that selects the sampling probability at each node in the graph in order to guarantee adaptive signal reconstruction and a target steady-state performance. Then, a distributed RLS strategy is derived and is shown to be convergent to its centralized counterpart. The performed numerical tests show the performance of the proposed adaptive method for distributed learning of graph signals.